Bitmap Indexing a Suitable Approach for Data Warehouse Design

نویسندگان

  • Kale Sarika Prakash
  • Joe Prathap
چکیده

Data warehouse is a collection of huge database which is subject oriented, integrated, time-variant and non volatile. As it is a set of huge database, fast data access is the major performance parameter of any data warehouse. Generally the information retrieved from Data Warehouse is summarized or aggregated as it is required for some decision making process of organization. To retrieve such a information queries to be fired is of the nature aggregation function followed by having clause. Extracting information efficiently from data warehouse is the challenge in front of researchers. As it is a huge database time required to access information is more compare to normal databases. Due to this creating index on this huge database is essential and it is important for increasing the performance of data warehouse .Selection of appropriate indexing decreases the query execution time and the performance of data warehouse is increase. Presently B-tree indexing is used in different database products. For creating the index on any table they uses B Tree approach. B tree indexing is useful for the databases where the frequent updates are required like On Line Transaction Processing system(OLTP). It is a time consuming approach for data warehouse and On Line Analytical System(OLAP). Data warehouse is not frequently updated so Bitmap indexing is appropriate choice for the same. We have to create bitmap index on required vector at the start only. Once it is created on fixed database we can use it any time for any query. As per the requirement of query we have to select bitmap and execute query. The bitmap indexing is appropriate choice for Data warehouse only because of its feature like it is non volatile and huge data set . KeywordsData warehouse(DW),Iceberg(IB) queries, bitmap index(BI),Online analytical Processing(OLAP),Online Transaction Processing(OLTP) ,Iceberg query(IBQ) __________________________________________________*****_________________________________________________

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bulkloading of Bitmap Indices

The conventional indexing technique designed for the traditional database systems does not use the read-only characteristics of the data warehouse environment. Recently, Bitmap Indexing has been proposed as a candidate indexing structure suitable for the read-only environments, like those of decision support systems. The current paper presents a short literature survey of the various clone of t...

متن کامل

An Adequate Design for Large Data Warehouse Systems: Bitmap index versus B-tree index

Although creating indexes on database is usually regarded as a common issue, it plays a key role in the query performance, particularly in the case of huge databases like a Data Warehouse where the queries are of complicated and ad hoc nature. Should an appropriate index structure be selected, the time required for query response will decrease extensively. To best of our knowledge, to date no c...

متن کامل

Evaluating Aggregate Functions of Iceberg Query Using Priority Based Bitmap Indexing Strategy

Received Apr 10, 2017 Revised Sep 8, 2017 Accepted Sep 29, 2017 Aggregate function and iceberg queries are important and common in many applications of data warehouse because users are generally interested in looking for variance or unusual patterns. Normally, the nature of the queries to be executed on data warehouse are the queries with aggregate function followed by having clause, these type...

متن کامل

Automatic Selection of Bitmap Join Indexes in Data Warehouses

The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when queries access very large volumes of data. To improve response time, data warehouse administrators generally use indexing techniques such as star join indexes or bitmap join indexes. This task is nevertheless complex and fas...

متن کامل

The Impact of Partitioned Fact Tables and Bitmap Index on Data Warehouse Performance

The design process is the most considered task of a data warehouse designer, this because of its performance criticality while going to production. Even if technology has developed in term of memory volume and speed, storage... the fact to minimize the execution time and the storage space still being a preoccupation for data warehousing specialists. This papers shows that using bitmap index and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015